Uniform proofs of standard completeness for extensions of first-order MTL
نویسندگان
چکیده
We provide general –and automatedly verifiable– sufficient conditions that ensure standard completeness for logics formalized Hilbert-style. Our approach subsumes many existing results and allows for the discovery of new fuzzy logics which extend first-order Monoidal T-norm Logic with propositional axioms.
منابع مشابه
An analysis of the constructive content of Henkin’s proof of Gödel’s completeness theorem DRAFT
Gödel’s completeness theorem for first-order logic is one of the best-known theorems of logic. Central to any foundational course in logic, it connects the notion of valid formula to the notion of provable formula. There are various views on the completeness theorem, various presentations, various formalisations, various proofs of it. We survey the most standard different approaches and eventua...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملStandard Completeness for Extensions of MTL: An Automated Approach
We provide general conditions on hypersequent calculi that guarantee standard completeness for the formalized logics. These conditions are implemented in the PROLOG system AxiomCalc that takes as input any suitable axiomatic extension of Monoidal T-norm Logic MTL and outputs a hypersequent calculus for the logic and the result of the check. Our approach subsumes many existing results and allows...
متن کاملOn n-contractive fuzzy logics
It is well known that MTL satisfies the finite embeddability property. Thus MTL is complete w.r.t. the class of all finite MTL-chains. In order to reach a deeper understanding of the structure of this class, we consider the extensions of MTL by adding the generalized contraction since each finite MTL-chain satisfies a form of this generalized contraction. Simultaneously, we also consider extens...
متن کاملExtending the Monoidal T-norm Based Logic with an Independent Involutive Negation
In this paper we investigate the logic MTL∼ obtained by extending Esteva and Godo’s logic MTL with an involutive negation ∼ not dependent on the t-norm and with the Baaz’s operator ∆. Moreover, we also introduce and study the related predicate calculus MTL∀∼. Algebraic and standard completeness results are shown to hold for both MTL∼ and MTL∀∼.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 603 شماره
صفحات -
تاریخ انتشار 2015